Polynomial-time algorithms for minimum energy scheduling

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

New polynomial-time cycle-canceling algorithms for minimum-cost flows

The cycle-canceling algorithm is one of the earliest algorithms to solve the minimum cost flow problem. This algorithm maintains a feasible solution x in the network G and proceeds by augmenting flows along negative cost directed cycles in the residual network G(x) and thereby canceling them. For the minimum cost flow problem with integral data, the generic version of the cycle-canceling algori...

متن کامل

Faster Algorithms for Minimum-Energy Scheduling of Wireless Data Transmissions

This paper considers the problem of minimizing the energy used in transmitting a given sequence of packets with specified completion deadlines from a node in a wireless packet network. The packets have to to be transmitted in first-in-first-out order. Packets can be destined to different receivers. The channel conditions to each receiver (and so the energy per bit needed) can be different and a...

متن کامل

Polynomial time approximation algorithms for machine scheduling: Ten open problems

We discuss what we consider to be the ten most vexing open questions in the area of polynomial time approximation algorithms for NP-hard deterministic machine scheduling problems. We summarize what is known on these problems, we discuss related results, and we provide pointers to the literature. Prologue In the early days of scheduling, the work of the theoretical research branch mainly consist...

متن کامل

Polynomial Time Algorithms for Scheduling of Arrival Aircraft

A Mixed Integer Linear Program (MILP) formulation of an arrival traffic scheduling problem is used as the starting point in order to evaluate the respective capabilities of two real-time scheduling algorithms. Three main issues are addressed: computational time, suboptimality and statistical performance. The first algorithm is an approximation algorithm, which is polynomial time and has a guara...

متن کامل

Polynomial-Time Algorithms for Designing Dual-Voltage Energy Efficient Circuits

Energy consumption of digital circuits has become a primary constraint in electronic design. The increasing popularity of the portable devices like smart phone, ipad, tablet and notebook has created an overwhelming demand for extended battery life of these devices. Numerous methods for energy reduction in CMOS circuits have been proposed in the literature. Power reduction techniques at various ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: ACM Transactions on Algorithms

سال: 2012

ISSN: 1549-6325,1549-6333

DOI: 10.1145/2229163.2229170